Efficient domination for classes of P6-free graphs
نویسندگان
چکیده
منابع مشابه
Weighted Efficient Domination in Classes of P6-free Graphs
In a graph G, an efficient dominating set is a subset D of vertices such that D is an independent set and each vertex outside D has exactly one neighbor in D. The Minimum Weight Efficient Dominating Set (Min-WED) problem asks for an efficient dominating set of total minimum weight in a given vertex-weighted graph; the Maximum Weight Efficient Dominating Set (Max-WED) problem is defined similarl...
متن کاملIndependence and Efficient Domination on P6-free Graph
In the Maximum Weight Independent Set problem, the input is a graph G, every vertex has a non-negative integer weight, and the task is to find a set S of pairwise non-adjacent vertices, maximizing the total weight of the vertices in S. We give an nO(log 2 n) time algorithm for this problem on graphs excluding the path P6 on 6 vertices as an induced subgraph. Currently, there is no constant k kn...
متن کاملEfficient algorithms for Roman domination on some classes of graphs
A Roman dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2} such that every vertex x with f (x) = 0 is adjacent to at least one vertex y with f (y) = 2. The weight of a Roman dominating function is defined to be f (V ) = ∑ x∈V f (x), and the minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G. In this paper we first answer ...
متن کاملOn Efficient Domination for Some Classes of H-Free Chordal Graphs
A vertex set D in a finite undirected graph G is an efficient dominating set (e.d.s. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s. in G, is known to be NP-complete even for very restricted graph classes such as for 2P3-free chordal graphs while it is solvable in polynomial time for P...
متن کاملWeighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time
In a finite undirected graph G = (V,E), a vertex v ∈ V dominates itself and its neighbors in G. A vertex set D ⊆ V is an efficient dominating set (e.d. for short) of G if every v ∈ V is dominated in G by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be NP-complete for P7-free graphs but solvable in linear time for P5-fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.08.019